Rate-compatible distributed arithmetic coding
نویسندگان
چکیده
منابع مشابه
distributed arithmetic با کارایی بالا
در این تحقیق، روش های پیاده سازی فیلتر با پاسخ ضربه محدود (فیلتر fir) مورد بررسی قرار می گیرد. برای پیاده سازی فیلتر fir از دو واحد(mac) multiply accumulate و distributed arithmetic (da) استفاده می شود. پیاده سازی فیلتر fir با da از 50 تا 80 درصد مساحت اشغالی را بهبود می دهد؛ همچنین توان مصرفی را نیز کاهش می دهد. روش هایی برای بهبود ساختار اولیه ی da نیز ارائه می شود که باعث افزایش کارایی فیلتر...
15 صفحه اولVariable bit rate ADPCM via arithmetic coding
section, leading to the introduction of our proposed variable bit rate system. After some coverage of the performance of the system with a standard linear predictor, we introduce a Kalman predictor, and show an approach to reduce the computational complexity. We discuss the use of perceptual weighting within the system, and bit error resynchronization for the Arithmetic Coding (AC) data stream....
متن کاملLow Bit Rate Model - Assisted H . 261 - Compatible Coding Of
We describe a method of object-selective quantizer control in a standard coding system based on MC DCT| CCITT Recommendation H.261. The approach is based on two novel algorithms, namely buuer rate modulation and buuer size modulation. By forcing the rate control algorithm to transfer a relatively small fraction|about 10{ 15% on average|of the total available bit rate from the coding of the non-...
متن کاملAsymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding
The modern data compression is mainly based on two approaches to entropy coding: Huffman (HC) and arithmetic/range coding (AC). The former is much faster, but approximates probabilities with powers of 2, usually leading to relatively low compression rates. The latter uses nearly exact probabilities easily approaching theoretical compression rate limit (Shannon entropy), but at cost of much larg...
متن کاملA General Fixed Rate Arithmetic Coding Method for Constrained Channels
This paper extends the result of earlier work on the application of arithmetic codes to the constrained channel problem. We specifically present a general length-based $xed rate implementation technique which performs the arithmetic coding recursions during each channel time unit. This technique is superior to an earlier unpublished code for general constrained channels. The approach permits th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2008
ISSN: 1089-7798
DOI: 10.1109/lcomm.2008.080645